Groups quasi-isometric to right-angled Artin groups
نویسندگان
چکیده
منابع مشابه
An Introduction to Right-angled Artin Groups
Recently, right-angled Artin groups have attracted much attention in geometric group theory. They have a rich structure of subgroups and nice algorithmic properties, and they give rise to cubical complexes with a variety of applications. This survey article is meant to introduce readers to these groups and to give an overview of the relevant literature. Artin groups span a wide range of groups ...
متن کاملRight-angled Artin groups and Out(Fn) I: quasi-isometric embeddings
We construct quasi-isometric embeddings from right-angled Artin groups into the outer automorphism group of a free group. These homomorphisms are modeled on the homomorphisms into the mapping class group constructed by Clay, Leininger, and Mangahas in [CLM12]. Toward this goal, we develop tools in the free group setting that mirror those for surface groups and discuss various analogs of subsurf...
متن کاملQuasi-isometric Classification of Some High Dimensional Right-angled Artin Groups
In this note we give the quasi-isometry classification for a class of right angled Artin groups. In particular, we obtain the first such classification for a class of Artin groups with dimension larger than 2; our families exist in every dimension.
متن کاملPushing fillings in right-angled Artin groups
We define a family of quasi-isometry invariants of groups called higher divergence functions, which measure isoperimetric properties “at infinity.” We give sharp upper and lower bounds on the divergence functions for right-angled Artin groups, using different pushing maps on the associated cube complexes. In the process, we define a class of RAAGs we call orthoplex groups, which have the proper...
متن کاملSurface Subgroups of Right-Angled Artin Groups
We consider the question of which right-angled Artin groups contain closed hyperbolic surface subgroups. It is known that a right-angled Artin group A(K) has such a subgroup if its defining graph K contains an n-hole (i.e. an induced cycle of length n) with n ≥ 5. We construct another eight “forbidden” graphs and show that every graph K on ≤ 8 vertices either contains one of our examples, or co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Duke Mathematical Journal
سال: 2018
ISSN: 0012-7094
DOI: 10.1215/00127094-2017-0042